Computing some distance functions between polygons
نویسندگان
چکیده
منابع مشابه
Computing some distance functions between polygons
We present algorithms for computing some distance functions between two (possibly intersecting) polygons, both in the convex and nonconvex cases. The interest for such distance functions comes from applications in robot vision, pattern recognition and contour fitting. We present a linear sequential algorithm and an optimal EREW·PRAM parallel algorithm for the case when the input polygons are co...
متن کاملComputing the Fréchet distance between simple polygons
We present the first polynomial-time algorithm for computing the Fréchet distance for a non-trivial class of surfaces: simple polygons. For this, we show that it suffices to consider homeomorphisms that map an arbitrary triangulation of one polygon to the other polygon such that diagonals of the triangulation are mapped to shortest paths in the other polygon.
متن کاملComputing the Fréchet Distance between Folded Polygons
We present the first results showing that the Fréchet distance between non-flat surfaces can be approximated within a constant factor in polynomial time. Computing the Fréchet distance for surfaces is a surprisingly hard problem. It is not known whether it is computable, it has been shown to be NP-hard, and the only known algorithm computes the Fréchet distance for flat surfaces (Buchin et al.)...
متن کاملComputing the Fréchet Distance Between Polygons with Holes
We study the problem of computing the Fréchet distance between subsets of Euclidean space. Even though the problem has been studied extensively for 1-dimensional curves, very little is known for d-dimensional spaces, for any d ≥ 2. For general polygons in R, it has been shown to be NP-hard, and the best known polynomial-time algorithm works only for polygons with at most a single puncture [Buch...
متن کاملComputing Teichmüller Maps between Polygons
By the Riemann-mapping theorem, one can bijectively map the interior of an n-gon P to that of another n-gon Q conformally. However, (the boundary extension of) this mapping need not necessarily map the vertices of P to those Q. In this case, one wants to find the “best" mapping between these polygons, i.e., one that minimizes the maximum angle distortion (the dilatation) over all points in P . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 1991
ISSN: 0031-3203
DOI: 10.1016/0031-3203(91)90045-7